Palindromic rich words and run-length encodings
نویسندگان
چکیده
منابع مشابه
Palindromic rich words and run-length encodings
We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
متن کاملRun-length encodings (Corresp.)
explicitly evaluable functions. For example, the M-ary error probability is expressed as a quadrature in Lindsey's equation (17), PE(M) = 1 [I-2 lrn Qi(h, $;) exp (-g) dz] z/d eeL s m =22/;;moe-(1+d)s~41-'2@3(1, 1 + M, s, sL) d.s, (5) where, following Lindsey, h2/2 has been replaced by L to simplify the notation. From the series form of @3, it is obvious that the integral gives an additional do...
متن کاملReconstructing words from a fixed palindromic length sequence
To every word w is associated a sequence Gw built by computing at each position i the length of its longest palindromic suffix. This sequence is then used to compute the palindromic defect of a finite word w defined by D(w) = |w| + 1 − |Pal(w)| where Pal(w) is the set of its palindromic factors. In this paper we exhibit some properties of this sequence and introduce the problem of reconstructin...
متن کاملPalindromic prefixes and episturmian words
Let w be an infinite word on an alphabet A. We denote by (ni)i≥1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an applicat...
متن کاملOn Highly Palindromic Words
We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords of a word characterizes the word up to reversal. Since each word trivially contains a palindromic subword of length at least half of its length—a power of the prevalent letter—we call a word that does not contain any palindromic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2016
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2016.07.001